A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
نویسندگان
چکیده
منابع مشابه
A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs
Given a graph G, the longest path problem asks to compute a simple path of G with the largest number of vertices. This problem is the most natural optimization version of the well-known and well-studied Hamiltonian path problem, and thus it is NP-hard on general graphs. However, in contrast to the Hamiltonian path problem, there are only a few restricted graph families, such as trees, and some ...
متن کاملThe Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, as it is a generalization of the Hamiltonian path problem. Motivated by the work of Uehara and Uno in [22], where they left the longest path problem open for the class of interval graphs, ...
متن کاملThe Longest Path Problem on Permutation Graphs
The longest path problem on graph G is a classic problem which is to find a simple path such that the number of vertices of the path is maximum among all possible paths of G. In this paper, we show that the longest path problem can be solved in linear time on permutation graphs.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn improved algorithm for the longest induced path problem on k-chordal graphs
Gavril [F. Gavril, Algorithms for maximum weight induced paths, Information Processing Letters 81 (2002) 203–208] showed that the length of a longest induced path for graphs having no induced cycles on more than k vertices can be computed in O(nkm) time where n and m denote the number of vertices and edges, respectively. In this paper, we present an O(nk) time algorithm for the same problem. c ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2012
ISSN: 0895-4801,1095-7146
DOI: 10.1137/100793529